A comparison of decision procedures in Presburger arithmetic
نویسندگان
چکیده
It is part of the tradition and folklore of automated reasoning that the intractability of Cooper s decision procedure for Presburger in teger arithmetic makes is too expensive for practical use More than years of work has resulted in numerous approximate procedures via rational arithmetic all of which are incom plete and restricted to the quanti er free frag ment In this paper we report on an exper iment which strongly questions this tradition We measured the performance of procedures due to Hodes Cooper and heuristic variants thereof which detect counterexamples across a corpus of randomly generated quanti er free Presburger formulae The results are start ling a variant of Cooper s procedure outper forms Hodes procedure on both valid and in valid formulae and is fast enough for prac tical use These results contradict much per ceived wisdom that decision procedures for in teger arithmetic are too expensive to use in practice
منابع مشابه
A Practical Extension Mechanism for Decision Procedures: the Case Study of Universal Presburger Arithmetic
In this paper, we propose a generic mechanism for extending decision procedures by means of a lemma speculation mechanism. This problem is important in order to widen the scope of decision procedures incorporated in state-of-the-art veri cation systems. Soundness and termination of the extension schema are formally stated and proved. As a case study, we consider extensions of a decision procedu...
متن کاملComplete Integer Decision Procedures as Derived Rules in HOL
I describe the implementation of two complete decision procedures for integer Presburger arithmetic in the HOL theorem-proving system. The first procedure is Cooper’s algorithm, the second, the Omega Test. Between them, the algorithms illustrate three different implementation techniques in a fully expansive system.
متن کاملFrom functional programming to multicore parallelism: A case study based on Presburger Arithmetic
The overall goal of this work is studying parallelization of functional programs with the specific case study of decision procedures for Presburger Arithmetic (PA). PA is a first order theory of integers accepting addition as its only operation. Whereas it has wide applications in different areas, we are interested in using PA in connection with the Duration Calculus Model Checker (DCMC) [5]. T...
متن کاملDecision Procedures for Recursive Data Structures with Integer Constraints
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus providing a tight coupling between the two theories, and hence the general Nelson-Oppen combination method for decision procedures is not applicable to this theory, even for the quantifier-free case. We present four decis...
متن کاملComputer Arithmetic: Logic, Calculation, and Rewriting
Computer arithmetic is the logical theory which formalizes the way computers manipulate integer numbers. In this paper, we describe a combined system whose components are a logical theory for the Isabelle theorem prover, a calculational engine based on rewriting techniques, and a decision procedure for an extension of quantiier-free Presburger arithmetic. The goal of this work is to provide a g...
متن کامل